Introduction to a Gram-Schmidt-type biorthogonalization method
نویسندگان
چکیده
منابع مشابه
Optimal Gram-schmidt Type Algorithms
A Gram-Schmidt type algorithm is given for finite d-dimensional reflexive forms over division rings. The algorithm uses d/3 + O(d) ring operations. Next, that algorithm is adapted in two new directions. First a sequential algorithm is given whose complexity matches the complexity of matrix multiplication. Second, a parallel NC algorithm is given with similar complexity.
متن کاملA weighted gram-schmidt method for convex quadratic programming
Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an a...
متن کاملSVP , Gram - Schmidt , LLL
Last time we defined the minimum distance λ1(L) of a lattice L, and showed that it is upper bounded by √ n · det(L)1/n (Minkowski’s theorem), but this bound is often very loose. Some natural computational questions are: given a lattice (specified by some arbitrary basis), can we compute its minimum distance? Can we find a vector that achieves this distance? Can we find good approximations to th...
متن کاملTwo-step demodulation based on the Gram-Schmidt orthonormalization method.
This Letter presents an efficient, fast, and straightforward two-step demodulating method based on a Gram-Schmidt (GS) orthonormalization approach. The phase-shift value has not to be known and can take any value inside the range (0,2π), excluding the singular case, where it corresponds to π. The proposed method is based on determining an orthonormalized interferogram basis from the two supplie...
متن کاملRobust Selective Gram-schmidt Reorthogonalization
A new criterion for selective reorthogonalization in the Gram-Schmidt procedure is given. We establish its comportment in presence of rounding errors when the criterion is used with modified Gram-Schmidt algorithm and show counter-example matrices which prove that standard criteria are not always valid. Experimentally, our criterion is fine also for the classical Gram-Schmidt algorithm with reo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2014
ISSN: 0035-7596
DOI: 10.1216/rmj-2014-44-4-1265